Time to Buffer Overflow in an MMPP Queue
نویسنده
چکیده
In this report we deal with the time to buffer overflow in a finite-buffer queue with MMPP (Markov-modulated Poisson process) arrivals. The results include a closed-form formula for the transform of the distribution of the time to buffer overflow. The main benefit of this formula is that, using properties of the transform, we can easily compute the average overflow time and all the moments (variance etc). Moreover, by means of an inversion algorithm, we can obtain the probability density function and cumulative distribution function of the overflow time. Analytical results are illustrated by a numerical example based on MMPP parameterization fitted to an IP traffic trace file.
منابع مشابه
A Unified Method of Analysis for Queues with Markovian Arrivals
We deal with finite-buffer queueing systems fed by a Markovian point process. This class includes the queues of type M/G/1/N, M/G/1/N, PH/G/1/N, MMPP/G/1/N, MAP/G/1/N, and BMAP/G/1/N and is commonly used in the performance evaluation of network traffic buffering processes. Typically, such queueing systems are studied in the stationary regime using matrixanalytic methods connected with M/G/1-typ...
متن کاملBuffer Overflow Period in a Constant Service Rate Queue
– When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the dist...
متن کاملA Novel Fuzzy Logic Controller (FLC) for Improving Internet-based Real-Time Application Timeliness by Eliminating User-Level Buffer Overflow
A novel FLC (Fuzzy Logic Controller) for eliminating buffer overflow at the user level is proposed. It tunes the buffer size in a dynamic manner to ensure that the buffer length always covers the queue length by the given safety margin ∆ . The FLC operation is based on the objective function: 2 } , 0 { ∆ . Our timing analysis shows that the FLC requires very short execution time for its control...
متن کاملEstimation of Buffer Overflow Probabilities and Economies of Scale in ATM Multiplexers by Analysis of a Model of Packetized Voice Traffic
Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM M ultiplexers by Analysis of a M odel of Packetized Voice Traffic by Paul J. Farrell We obtain upper bounds on the probability of buffer overflow for an ATM multiplexer of L identical packetized voice sources The multiplexer is modelled by a FCFS single server queue The arrivals at the multiplexer are a homogenous superpo...
متن کاملOptimal Scheduling Algorithm for Throughput Maximization in Multihop Wireless Networks
In this paper, focus on designing a scheduling scheme for achieve maximum throughput. Although, it does not require per-flow or perdestination information and also, this paper consider the problem of link scheduling in Multihop Wireless Networks under general interference constraints. The main goal is to achieve maximum throughput and better delay performance at low complexity. Previously, we u...
متن کامل